
public class nod {
	public long evklid_func 	(long a, long b)
	{
		while (b !=0) 
		{
		      long tmp = a % b;
		      a = b;
		      b = tmp;
		}
		return a;
	}
	public long my_func 	(long a, long b)
	{
		long c = 1;
		long nod = 0;
		if (a < b) c = a;
		else c = b;
		for (int i = 1; i<=c; i++)
		{
			if (a % i == 0 && b % i == 0) nod = i;
		}
		return nod;
	}
}
